The Brisk Machine: A Simplified STG Machine
نویسندگان
چکیده
This work presents the Brisk Machine, a machine model for the implementation of functional languages. It is especially designed to be exible and dynamic, so that it can support a uniform and e cient implementation of multiple paradigms such as computational mobility, dynamic loading and linking, and logic programming. The Brisk Machine is based on the STG Machine, though its model is simpli ed and adapted so that the various paradigms it supports can be accommodated easily without interference between them.
منابع مشابه
The Brisk Machine: A Simpli ed STG Machine
This work presents the Brisk Machine, a machine model for the implementation of functional languages. It is especially designed to be exible and dynamic, so that it can support a uniform and e cient implementation of multiple paradigms such as computational mobility, dynamic loading and linking, and logic programming. The Brisk Machine is based on the STG Machine, though its model is simpli ed ...
متن کاملThe Brisk Machine : A Simpli ed STG
This work presents the Brisk Machine, a machine model for the implementation of functional languages. It is especially designed to be exible and dynamic, so that it can support a uniform and eecient implementation of multiple paradigms such as computational mobility, dynamic loading and linking, and logic programming. The Brisk Machine is based on the STG Machine, though its model is simpliied ...
متن کاملEMA : implementing the rewriting computational model of Escher
Escher is a new functional logic programming language which was designed to combine the best ideas of existing single-paradigm languages. The computational model of Escher is based on rewriting with residuation. The Escher systems module Booleans contains a number of well-chosen rewrite rules which de ne the basics of logic programming in Escher. Due to the novel integration approach of functio...
متن کاملConcurrent and distributed functional systems
This thesis presents the Brisk Machine [54], a machine for executing functional languages, designed to be simple and exible to support a number of run-time execution models for the Brisk compiler. Design considerations have been made to support dynamic loading, deterministic concurrency [23, 51], distribution, debugging tools and logic programming [76]. To achieve this, the compiler's intermedi...
متن کاملThree New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997